66B - Petya and Countryside - CodeForces Solution

                                                     /*JODD or WOTT!*/
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define f(i,k,n) for(int i=k;i<n;i++)
#define PI 3.1415926535897932384626433832795
#define EPS 1e-9
#define PB push_back
#define MOD 100000007
#define MAX INT_MAX
#define MIN INT_MIN
class Graph
{
    public:
    map<int, bool> visited;
    map<int, list<int> > adj;
    void addEdge(int v, int w);
    
    void DFS(int v,vector<int> &ans);
    
};
void Graph::addEdge(int v, int w)
{
    adj[v].push_back(w);
}
 
void Graph::DFS(int v, vector<int> &ans)
{
    visited[v] = true;
    
    ans.push_back(v);
    list<int>::iterator i;
    for (i = adj[v].begin(); i != adj[v].end(); ++i)
    {   
        if (!visited[*i])
            DFS(*i,ans);
    }
        
}


void run_case()
    {
     int n;
     cin>>n;
  int a[n];
  f(i,0,n)cin>>a[i];
  int ans=0;
  f(i,0,n)
  {
      int l=i,r=i;
      int cnt=1;
      while(l>0 && a[l]>=a[l-1]){
          cnt++;l--;
      }
      while(r+1<n && a[r]>=a[r+1]){
          cnt++;r++;
      }
      ans=max(ans,cnt);
  }
    cout<<ans<<endl;
    }


signed main()
{

ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int t=1;//cin>>t;

   while(t--)
   {
       run_case();
   }
return 0;
}